Genetic Algorithm for Solving Course Timetable Problems

Coarse-Grained Parallel Genetic Algorithm for Solving the Timetable Problem

This work studies the application of Genetic Algorithm (GA) to solve the timetable problem (TTP), a problem that is a highly constrained problem. However, the major disadvantage of GA is that the algorithm uses a tremendous amount of processing time. This paper proposes a method that can reduce the processing time by using Parallel Genetic Algorithm (PGA) on the Beowulf-style cluster computer. ...

genetic algorithm based on explicit memory for solving dynamic problems

nowadays, it is common to find optimal point of the dynamic problem; dynamic problems whose optimal point changes over time require algorithms which dynamically adapt the search space instability. in the most of them, the exploitation of some information from the past allows to quickly adapt after an environmental change (some optimal points change). this is the idea underlining the use of memo...

Solving Timetable Problem by Genetic Algorithm and Heuristic Search Case Study: Universitas Pelita Harapan Timetable

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Solving Timetabling problems using Genetic Algorithm Technique

The timetabling problem is always a difficult task which comes up every calendar year in educational institutions. More especially if it has to be done manually. Various institutions of learning across the country are being faced with a lot of difficulties preparing examination timetable. Most of this problems are usually attributed to the constant increase in the number of students and courses...